Union and intersection types to support both dynamic and static typing
نویسندگان
چکیده
منابع مشابه
Union and intersection types to support both dynamic and static typing
Although static typing provides undeniable benefits for the development of applications, dynamically typed languages have become increasingly popular for specific scenarios. Since each approach offers different benefits, the StaDyn programming language has been designed to support both dynamic and static typing. This paper describes the minimal core of the StaDyn programming language. Its type ...
متن کاملSession Types = Intersection Types + Union Types
We propose a semantically grounded theory of session types which relies on intersection and union types. We argue that intersection and union types are natural candidates for modeling branching points in session types and we show that the resulting theory overcomes some important defects of related behavioral theories. In particular, intersections and unions provide a native solution to the pro...
متن کاملSubtyping with Union Types, Intersection Types and Recursive Types II
This paper is a follow-up on previous work by the author on subtyping with (set-theoretic) union, intersection and recursive types. Previously, it was shown how types may be encoded as regular tree expressions/set constraints. This gave rise to a sound and complete decision procedure for type inclusion. The result was, however, limited to a rather speciic type language. In the work reported on ...
متن کاملTyping Classes and Mixins with Intersection Types
We study an assignment system of intersection types for a lambda-calculus with records and a recordmerge operator, where types are preserved both under subject reduction and expansion. The calculus is expressive enough to naturally represent mixins as functions over recursively defined classes, whose fixed points, the objects, are recursive records. In spite of the double recursion that is invo...
متن کاملSubtyping with Union Types, Intersection Types and Recursive Types
This paper is a follow-up on previous work by the author on sub-typing with (set-theoretic) union, intersection and recursive types. Previously, it was shown how types may be encoded as regular tree expressions/set constraints. This gave rise to a sound and complete decision procedure for type inclusion. The result was, however, limited to a rather speciic type language. In the work reported on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2011
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2010.12.006